منابع مشابه
Datalog+- Ontology Consolidation
Knowledge bases in the form of ontologies are receiving increasing attention as they allow to clearly represent both the available knowledge, which includes the knowledge in itself and the constraints imposed to it by the domain or the users. In particular, Datalog± ontologies are attractive because of their property of decidability and the possibility of dealing with the massive amounts of dat...
متن کاملOntology consolidation in bioinformatics
Ontologies enjoy increasing popularity among bioinformatics researchers who seek assistance in coping with the rapid upgrowth of biological data to be handled and related information to be considered. While communities of committed ontology pioneers drive the development and optimisation of ontologies for a wide range of relevant domains, the amble adoption of ontologies in bioinformatics resea...
متن کاملOntology Module Extraction via Datalog Reasoning
Module extraction—the task of computing a (preferably small) fragment M of an ontology T that preserves entailments over a signature Σ—has found many applications in recent years. Extracting modules of minimal size is, however, computationally hard, and often algorithmically infeasible. Thus, practical techniques are based on approximations, where M provably captures the relevant entailments, b...
متن کاملDatalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
We study the problem of rewriting a disjunctive datalog program into plain datalog. We show that a disjunctive program is rewritable if and only if it is equivalent to a linear disjunctive program, thus providing a novel characterisation of datalog rewritability. Motivated by this result, we propose weakly linear disjunctive datalog—a novel rule-based KR language that extends both datalog and l...
متن کاملFrom Datalog Reasoning to Modular Structure of an Ontology
We propose a novel approach to modularly structuring an ontology. First, a ontology TBox is transformed into a datalog program. Second, a tree, which represents forward-chaining proof and contains information about modules, is mapped to a digraph, which allows us to extract intended ontology module via breadth-first search. Finally, we develop an algorithm to compute the modular structure of an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2016
ISSN: 1076-9757
DOI: 10.1613/jair.5131